Downward pattern refinement for timed automata
نویسندگان
چکیده
منابع مشابه
Automatic Abstraction Refinement for Timed Automata
We present a fully automatic approach for counterexample guided abstraction refinement of real-time systems modelled in a subset of timed automata. Our approach is implemented in the MOBY/RT tool environment, which is a CASE tool for embedded system specifications. Verification in MOBY/RT is done by constructing abstractions of the semantics in terms of timed automata which are fed into the mod...
متن کاملTimed Automata for Behavioral Pattern Recognition
Real-world systems can often be modelled by systems consisting of states and transitions between these states, triggered by certain events. These systems are called discrete event systems [4]. We are interested in the creation of such an event system for the detection of different types of behavior within a real-world system. The detection takes place using time series data from different kinds...
متن کاملSAT-based Abstraction Refinement for (Timed) Constraint Automata
Failures within embedded systems of automotive industry, railway technology, and avionics usually have disastrous consequences. Dominant features of such safetycritical systems are that safety not only depends on the values of variables communicated between components, but also on (inter-component) actions and reactions that arrive in time. For instance, a train controller needs to apply the br...
متن کاملThe Downward Refinement Property
Using abstraction in planning does not guarantee an im provement in search efficiency; it is possible for an abstract planner to display worse performance than one that does not use abstraction. Analysis and experiments have shown that good abstraction hierarchies have, or are close to having, the downward refinement property, whereby, given that a concrete-level solution exists, every abstrac...
متن کاملAn Abstraction Refinement Technique for Timed Automata Based on Counterexample-Guided Abstraction Refinement Loop
ion Inputs A , h {h = abstraction function} Ŝ := ∅, →̂ := ∅ {M̂ = (Ŝ, ŝ0, →̂)} foreach l ∈ L do Ŝ := Ŝ ∪ {h(l)} end for ŝ0 := h(l0) foreach (l1, a, g, r, l2) ∈ T do →:=→ ∪{(h(l1), h(l2))} end for return M̂
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal on Software Tools for Technology Transfer
سال: 2014
ISSN: 1433-2779,1433-2787
DOI: 10.1007/s10009-014-0346-x